#define OK 1
#define ERROR 0


status ListInsert(Linklist *L, int i ,ElemType e);
{
    int j;
    Linklist p,a;

    p = *L;
    j = 1;

    while (p && j <i)
    {
       p = p->next;
       j++; 	           
    }
    if (!p || j >i) 
    {
       return ERROR;
    }
    a = (Linklist)malloc(sizeof(node));
    s ->data = e;

    s ->next = p ->next;
    p ->next = s;

       return OK;    
}

